l = ['a', 'e', 'i', 'o', 'u', 'y']
L = ["A", "E", "I", "O", "U", "Y"]
n = input()
string = ""
for i in n:
if i not in (l + L):
if i.isupper():
string += '.' + i.lower()
else:
string += '.' + i
print(string)#include <bits/stdc++.h>
using namespace std;
int main()
{
string in="";
cin>>in;
string out="";
int n=in.size();
char c='0';
for(int i=0;i<n;i++)
{
c=tolower(in[i]);
if(c!='a'&&c!='e'&&c!='i'&&c!='o'&&c!='u'&&c!='y')
{
out=out+".";
out=out+c;
}
}
cout<<out;
return 0;
}566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |